we show that the category of convergence approach spaces is a simultaneously reective and coreective subcategory of the category of latticevalued limit spaces. further we study the preservation of diagonal conditions, which characterize approach spaces. it is shown that the category of preapproach spaces is a simultaneously reective and coreective subcategory of the category of lattice-valued p...

We show that the category of convergence approach spaces is a simultaneously reective and coreective subcategory of the category of latticevalued limit spaces. Further we study the preservation of diagonal conditions, which characterize approach spaces. It is shown that the category of preapproach spaces is a simultaneously reective and coreective subcategory of the category of lattice-valued p...

We study L-categories of lattice-valued convergence spaces. Suchcategories are obtained by fuzzifying" the axioms of a lattice-valued convergencespace. We give a natural example, study initial constructions andfunction spaces. Further we look into some L-subcategories. Finally we usethis approach to quantify how close certain lattice-valued convergence spacesare to being lattice-valued topologi...

We apply the inductive counting technique to nondetermin-istic branching programs and prove that complementation on this model can be done without increasing the width of the branching programs too much. This shows that for an arbitrary space bound s(n), the class of languages accepted by nonuniform nondeterministic O(s(n)) space bounded Turing machines is closed under complementation. As a con...

It is shown that the notion of balancing a state space realization about a stable, isolated equilibrium point can be generalized to systems possessing only a stable invariant regular submanifold of arbitrary dimension, for example, a stable limit cycle.

The present paper deals with the co-learnability of enumerable families L of uniformly recursive languages from positive data. This refers to the following scenario. A family L of target languages as well as hypothesis space for it are speci ed. The co-learner is fed eventually all positive examples of an unknown target language L chosen from L. The target language L is successfully colearned i...